Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
511	Independent dominating sets in graphs of girth five Ararat Harutyunyan∗ Paul Horn† Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2010-09-24 16:29:59 NP-complete problems Dominating set Weight Graph coloring Graph theory Theoretical computer science Mathematics
512	Sage Reference Manual: Graph Theory Release 6.6.beta0 The Sage Development Team February 21, 2015 Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:21 Graph Neighbourhood Adjacency matrix Line graph Directed acyclic graph Hamiltonian path Eulerian path Tree Independent set Graph theory Mathematics NP-complete problems
513	UNIVERSITÉ DE BORDEAUX I LABORATOIRE BORDELAIS DE RECHERCHE EN INFORMATIQUE HABILITATION À DIRIGER DES RECHERCHES AU TITRE DE L’ÉCOLE DOCTORALE DE MATHÉMATIQUES ET D’INFORMATIQUE Add to Reading List Source URL: www.labri.fr Language: English - Date: 2010-11-27 17:55:14 Graph partition Graph Graph coloring Path decomposition Graph theory Theoretical computer science NP-complete problems
514	Dynamic Symmetry Breaking by Simulating Zykov Contraction Bas Schaafsma, Marijn Heule! and Hans van Maaren Department of Software Technology, Delft University of Technology [removed], [removed], h.van Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-04-21 07:17:46 Graph coloring NP-complete problems Complexity classes Boolean satisfiability problem SL 2-satisfiability Greedy coloring Theoretical computer science Graph theory Mathematics
515	PT-Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Shortest path problem Graph Tree Graph coloring Path decomposition Graph theory Theoretical computer science Mathematics
516	Scotch and libScotch 4.0 User’s Guide∗ Fran¸cois Pellegrini ScAlApplix project, INRIA Futurs ENSEIRB & LaBRI, UMR CNRS 5800 Universit´e Bordeaux I 351 cours de la Lib´eration, 33405 TALENCE, FRANCE Add to Reading List Source URL: www.labri.fr Language: English - Date: 2007-08-08 05:02:28 NP-complete problems Shortest path problem Tree Graph Graph theory Theoretical computer science Mathematics
517	Improvement of the E ien y of Geneti Algorithms for S alable Parallel Graph Partitioning in a Multi-Level Framework Cédri Chevalier and François Pellegrini LaBRI and INRIA Futurs Add to Reading List Source URL: www.labri.fr Language: English - Date: 2006-05-21 08:07:32 NP-complete problems Applied mathematics Degree Topological graph theory Graph partition Theoretical computer science Mathematics Graph theory
518	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics
519	Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest IPB & LaBRI, UMR CNRS 5800 Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Scotch Shortest path problem Graph partition Algorithm Nested dissection Graph Mathematics Theoretical computer science Graph theory
520	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory

UPDATE